Adaptive Link Selection Strategies for Distributed Estimation in Wireless Sensor Networks

نویسندگان

  • Songcen Xu
  • Rodrigo C. de Lamare
  • H. Vincent Poor
چکیده

In this work, we propose adaptive link selection strategies for distributed estimation in diffusion-type wireless networks. We develop an exhaustive search-based link selection algorithm and a sparsity-inspired link selection algorithm that can exploit the topology of networks with poor-quality links. In the exhaustive searchbased algorithm, we choose the set of neighbors that results in the smallest excess mean square error (EMSE) for a specific node. In the sparsity-inspired link selection algorithm, a convex regularization is introduced to devise a sparsity-inspired link selection algorithm. The proposed algorithms have the ability to equip diffusion-type wireless networks and to significantly improve their performance. Simulation results illustrate that the proposed algorithms have lower EMSE values, a better convergence rate and significantly improve the network performance when compared with existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Target Tracking with Unknown Maneuvers Using Adaptive Parameter Estimation in Wireless Sensor Networks

Abstract- Tracking a target which is sensed by a collection of randomly deployed, limited-capacity, and short-ranged sensors is a tricky problem and, yet applicable to the empirical world. In this paper, this challenge has been addressed a by introducing a nested algorithm to track a maneuvering target entering the sensor field. In the proposed nested algorithm, different modules are to fulfill...

متن کامل

Mathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks

In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...

متن کامل

Tracking performance of incremental LMS algorithm over adaptive distributed sensor networks

in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Dynamic Topology Adaptation Based on Adaptive Link Selection Algorithms for Distributed Estimation

This paper presents adaptive link selection algorithms for distributed estimation and considers their application to wireless sensor networks and smart grids. In particular, exhaustive search–based least–mean–squares(LMS)/recursive least squares(RLS) link selection algorithms and sparsity–inspired LMS/RLS link selection algorithms that can exploit the topology of networks with poor–quality link...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1401.3785  شماره 

صفحات  -

تاریخ انتشار 2014